Some Incomplete But Boundedly Complete Location Families
نویسندگان
چکیده
منابع مشابه
Some incomplete and boundedly complete families of discrete distributions
We present a general result giving us families of incomplete and boundedly complete families of discrete distributions. For such families, the classes of unbiased estimators of zero with finite variance and of parametric functions which will have uniformly minimum variance unbiased estimators with finite variance are explicitly characterized. The general result allows us to construct a large nu...
متن کاملBoundedly Rational Dynamic Programming: Some Preliminary Results
A key open question in economics is the practical, portable modeling of bounded rationality. In this short note, I report ongoing progress that is more fully developed elsewhere. I present some results from a new model in which the decision-maker builds a simplified representation of the world. The model allows to model boundedly rational dynamic programming in a parsimonious and quite tractabl...
متن کاملComplete / Incomplete Hierarchical Hub Center Single Assignment Network Problem
In this paper we present the problem of designing a three level hub center network. In our network, the top level consists of a complete network where a direct link is between all central hubs. The second and third levels consist of star networks that connect the hubs to central hubs and the demand nodes to hubs and thus to central hubs, respectively. We model this problem in an incomplete net...
متن کاملComplete characterization of the Mordell-Weil group of some families of elliptic curves
The Mordell-Weil theorem states that the group of rational points on an elliptic curve over the rational numbers is a finitely generated abelian group. In our previous paper, H. Daghigh, and S. Didari, On the elliptic curves of the form $ y^2=x^3-3px$, Bull. Iranian Math. Soc. 40 (2014), no. 5, 1119--1133., using Selmer groups, we have shown that for a prime $p...
متن کاملChromatic Equivalence Classes of Some Families of Complete Tripartite Graphs
We obtain new necessary conditions on a graph which shares the same chromatic polynomial as that of the complete tripartite graph Km,n,r. Using these, we establish the chromatic equivalence classes for K1,n,n+1 (where n ≥ 2). This gives a partial solution to a question raised earlier by the authors. With the same technique, we further show that Kn−3,n,n+1 is chromatically unique if n ≥ 5. In th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Statistics
سال: 1993
ISSN: 0090-5364
DOI: 10.1214/aos/1176349416